inference rule completeness

英 [ˈɪnfərəns ruːl kəmˈpliːtnəs] 美 [ˈɪnfərəns ruːl kəmˈpliːtnəs]

网络  推理规则完整性; 推理规则的完备性

计算机



双语例句

  1. Based on RUE-NRF inference rule, the concepts of RUE-NRF input refutation, RUE-NRF unit refutation and RUE-NRF lock refutation are defined. The relation between RUE-NRF input refutation and RUE-NRF unit refutation and the completeness of RUE-NRF lock resolution are proved also.
    本文在RUE-NRF推理规则的基础上,定义了RUE-NRF输入归结、RUE-NRF单元归结及RUE-NRF锁归结的概念,证明了RUE-NRF输入反驳与RUE-NRF单元反驳的关系,以及RUE-NRF锁反驳的完备性。